Embedding spanning subgraphs of small bandwidth
نویسندگان
چکیده
In this paper we prove the following conjecture by Bollobás and Komlós: For every γ > 0 and positive integers r and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ( r−1 r +γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H.
منابع مشابه
Local heuristics and the emergence of spanning subgraphs in complex networks
We study the use of local heuristics to determine spanning subgraphs for use in the dissemination of information in complex networks. We introduce two different heuristics and analyze their behavior in giving rise to spanning subgraphs that perform well in terms of allowing every node of the network to be reached, of requiring relatively few messages and small node bandwidth for information dis...
متن کاملSpanning 3-colourable subgraphs of small bandwidth in dense graphs
A conjecture by Bollobás and Komlós states the following: For every γ > 0 and integers r ≥ 2 and ∆, there exists β > 0 with the following property. If G is a sufficiently large graph with n vertices and minimum degree at least ( r−1 r + γ)n and H is an r-chromatic graph with n vertices, bandwidth at most βn and maximum degree at most ∆, then G contains a copy of H. This conjecture generalises s...
متن کاملForcing spanning subgraphs via Ore type conditions
We determine an Ore type condition that allows the embedding of 3-colourable bounded degree graphs of sublinear bandwidth: For all ∆, γ > 0 there are β, n0 > 0 such that for all n ≥ n0 the following holds. Let G = (V,E) and H be n-vertex graphs such that H is 3-colourable, has maximum degree ∆(H) ≤ ∆ and bandwidth bw(H) ≤ βn, and G satisfies deg(u) + deg(v) ≥ ( 3 + γ)n for all uv / ∈ E. Then G ...
متن کاملSpanning tree congestion critical graphs
The linear or cyclic cutwidth of a graph G is the minimum congestion when G is embedded into either a path or a cycle respectively. A graph is cutwith critical if it is homeomorphically minimal and all of its subgraphs have lower cutwitdth. Our purpose is to extend the study of congestion critical graphs to embeddings on spanning trees.
متن کاملSpanning embeddings of arrangeable graphs with sublinear bandwidth
The Bandwidth Theorem of Böttcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175–205] gives minimum degree conditions for the containment of spanning graphs H with small bandwidth and bounded maximum degree. We generalise this result to a-arrangeable graphs H with ∆(H) ≤ √ n/ log n, where n is the number of vertices of H. Our result implies that sufficiently large n-vertex graphs G with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 29 شماره
صفحات -
تاریخ انتشار 2007